Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing

In secure multiparty computation (MPC), floating-point numbers should be handled in many potential applications, but these are basically expensive. particular, for MPC based on secret sharing (SS), the addition takes communication rounds though is most fundamental operation. this paper, we propose an SS-based two-party protocol with 13 (for single/double precision numbers), which much fewer than milestone work of Aliasgari et al. NDSS 2013 (34 and 36 rounds, respectively) also state art literature. Moreover, contrast to existing protocols all “roundTowardZero” rounding mode IEEE 754 standard, another 15 first result realizing more accurate “roundTiesToEven” mode. We discuss possible applications latter Validated Numerics (a.k.a. Rigorous Computation) by implementing a simple example.